A COMBINED UPPER AND LOWER BOUND ANALYSIS AND ITS APPLICATIONS
نویسندگان
چکیده
منابع مشابه
a contrastive analysis of concord and head parameter in english and azerbaijani
این پایان نامه به بررسی و مقایسه دو موضوع مطابقه میان فعل و فاعل (از نظر شخص و مشار) و هسته عبارت در دو زبان انگلیسی و آذربایجانی می پردازد. اول رابطه دستوری مطابقه مورد بررسی قرار می گیرد. مطابقه به این معناست که فعل مفرد به همراه فاعل مفرد و فعل جمع به همراه فاعل جمع می آید. در انگلیسی تمام افعال، بجز فعل بودن (to be) از نظر شمار با فاعلشان فقط در سوم شخص مفرد و در زمان حال مطابقت نشان میدهند...
15 صفحه اولa phonological contrastive analysis of kurdish and english
deposite the different criticisms on contrastive analysis it has been proved that the results of it(when processed)can be usuful in a tefl environment,specially at the level of phonology.this study is an attempt to compare and contrast the sound systems of kurdish and english for pedagogical aims. the consonants,vowels,stress and intonation of the twolanguages are described by the same model-ta...
15 صفحه اولcohesion and cohesive devices in a contrastive analysis between ge and esp texts
the present study was an attempt to conduct a contrastive analysis between general english (ge) and english for specific purposes (esp) texts in terms of cohesion and cohesive devices. to this end, thirty texts from different esp and ge textbooks were randomly selected. then they were analyzed manually to find the frequency of cohesive devices. cohesive devices include reference, substitution, ...
15 صفحه اولKernelization: New Upper and Lower Bound Techniques
In this survey, we look at kernelization: algorithms that transform in polynomial time an input to a problem to an equivalent input, whose size is bounded by a function of a parameter. Several results of recent research on kernelization are mentioned. This survey looks at some recent results where a general technique shows the existence of kernelization algorithms for large classes of problems,...
متن کاملNew Upper and Lower Bound Sifting Iterations
with fκ(s) as large as possible (resp. Fκ(s) as small as possible) given that the above inequality holds for all choices of A satisfying (1). Selberg [3] has shown (in a much more general context) that the functions fκ(s), Fκ(s) are continuous, monotone, and computable for s > 1, and that they tend to 1 exponentially as s goes to infinity. Let β = β(κ) be the infimum of s such that fκ(s) > 0. S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Doboku Gakkai Ronbunshu
سال: 1984
ISSN: 0289-7806,1882-7187
DOI: 10.2208/jscej.1984.350_125